Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming

نویسندگان

چکیده

Abstract We study nonlinear optimization problems with a stochastic objective and deterministic equality inequality constraints, which emerge in numerous applications including finance, manufacturing, power systems and, recently, deep neural networks. propose an active-set sequential quadratic programming (StoSQP) algorithm that utilizes differentiable exact augmented Lagrangian as the merit function. The adaptively selects penalty parameters of Lagrangian, performs line search to decide stepsize. global convergence is established: for any initialization, KKT residuals converge zero almost surely . Our analysis further develop prior work Na et al. (Math Program, 2022. https://doi.org/10.1007/s10107-022-01846-z ). Specifically, we allow constraints without requiring strict complementary condition; refine some designs (2022) such feasibility error condition monotonically increasing sample size; strengthen guarantee; improve complexity on Hessian. demonstrate performance designed subset collected CUTEst test set constrained logistic regression problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Quadratic Programming forLarge - Scale Nonlinear Optimization ?

The sequential quadratic programming (SQP) algorithm has been one of the most successful general methods for solving nonlinear constrained optimization problems. We provide an introduction to the general method and show its relationship to recent developments in interior-point approaches. We emphasize large-scale aspects.

متن کامل

Sequential equality-constrained optimization for nonlinear programming

A new method is proposed for solving optimization problems with equality constraints and bounds on the variables. In the spirit of Sequential Quadratic Programming and Sequential Linearly-Constrained Programming, the new method approximately solves, at each iteration, an equality-constrained optimization problem. The bound constraints are handled in outer iterations by means of an Augmented Lag...

متن کامل

P , Sequential Quadratic Constrained Quadratic Programming

We follow the popular approach for unconstrained minimization, i.e. we develop a local quadratic model at a current approximate minimizer in conjunction with a trust region. We then minimize this local model in order to nd the next approximate minimizer. Asymptot-ically, nding the local minimizer of the quadratic model is equivalent to applying Newton's method to the stationarity condition. For...

متن کامل

A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization

We consider optimization problems with objective and constraint functions that may be nonconvex and nonsmooth. Problems of this type arise in important applications, many having solutions at points of nondifferentiability of the problem functions. We present a line search algorithm for situations when the objective and constraint functions are locally Lipschitz and continuously differentiable o...

متن کامل

Sequential quadratic programming methods for parametric nonlinear optimization

Sequential quadratic programming (SQP) methods are known to be efficient for solving a series of related nonlinear optimization problems because of desirable hot and warm start properties–a solution for one problem is a good estimate of the solution of the next. However, standard SQP solvers contain elements to enforce global convergence that can interfere with the potential to take advantage o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 2023

ISSN: ['0025-5610', '1436-4646']

DOI: https://doi.org/10.1007/s10107-023-01935-7